Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations

The aim of the paper is to propose an iterative regularization method of proximal point type for finding a common solution for a finite family of inverse-strongly monotone equations in Hilbert spaces.     

sum from n=1 to +∞(1/n~(2m))的初等解法

本文用初等的方法研究sum from n=1 to(1/n~(2m))(m∈N)的求和问题。这个问题最先由Euler[8]解决。文献[1][6]给出了另两种求解方法。特别地,对于m=1的情形,即sum from n=1 to ∞(1/n~2)=((π~2)/6),已有许多不同的证明方法,可见文献[2][3][4][5]以及那里的参考文献。本文的想法,主要受文献[5][6]的启发而来的。     

解析函数中的Bohr型不等式的生成

利用非负连续函数{ζ_n(r)}_n≥0加细在单位圆盘|z|<1内满足Ref(z)<1的解析函数类的玻尔半径,和加细在单位圆盘|z|<1内形如■的解析函数的交错级数A_f(r)的玻尔半径.在后一种情况,本文也得到了偶和奇解析函数的玻尔半径的信息.进一步,建立了优级数M_f(r)与f(z)的奇数位和偶数位的关系,并将证明本文的大部分结果都是精确的.     

On some Diophantine fourier series

We continue our study on arithmetical Fourier series by considering two Fourier series which are related to Diophantine analysis. The first one was studied by Hardy and Littlewood in connection with the classification of numbers and the second one was studied by Hartman and Wintner by Lebesgue integration theory.     

关于Smarandache对偶函数

定义Smarandache对偶函数S*(n)为最大的正整数m使得m!|n.定义另一种双阶乘函数S**(n)为最大的正整数2m-1使得(2m-1)!!|n,其中2 n;且当2|n时,为最大的正整数2m使得(2m)!!|n.本文的主要目的是利用初等方法研究一个包含S**(n)的无穷级数的收敛性,并给出一个有趣的恒等式.     

关于正整数的六边形数部分

对任意正整数n,设b(n)表示n的六边形数部分.即就是b(n)=m(2m-1),如果m(2m-1)≤n＜(m 1)(2m 1),n∈N.本文主要目的是研究一个Dirichlet 级数的收敛性,并给出f(2)的一个精确的计算公式.     

On approximation by spherical reproducing kernel Hilbert spaces

The spherical approximation between two nested reproducing kernels Hilbert spaces generated from different smooth kernels is investigated. It is shown that the functions of a space can be approximated by that of the subspace with better smoothness. Furthermore, the upper bound of approximation error is given.